Robust distributed scheduling via time-period aggregation
نویسندگان
چکیده
منابع مشابه
Robust distributed scheduling via time-period aggregation
In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction d...
متن کاملRobust Distributed Data Aggregation
One application of aggregation is decentralized network size estimation algorithms. Systems, such as Skype, estimate the number of active users by centralized algorithms, enacting a high demand on central resources and creating single points of failure. Aggregation introduces scalable decentralized algorithms that allow counting (or summing in the general case) over a distributed network of nod...
متن کاملNew Robust Stability Criteria for Uncertain Neutral Time-Delay Systems With Discrete and Distributed Delays
In this study, delay-dependent robust stability problem is investigated for uncertain neutral systems with discrete and distributed delays. By constructing an augmented Lyapunov-Krasovskii functional involving triple integral terms and taking into account the relationships between the different delays, new less conservative stability and robust stability criteria are established first using the...
متن کاملTail-robust scheduling via limited processor sharing
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed workload distributions, and vice-versa, leading to fundamental problems in designing schedulers that are robust to distributional assumptions on the job sizes. This paper shows how to exploit partial workload information (sy...
متن کاملSwitched PIOA: Parallel composition via distributed scheduling
This paper presents the framework of switched probabilistic input/output automata (or switched PIOA), augmenting the original PIOA framework with an explicit control exchange mechanism. Using this mechanism, we model a network of processes passing a single token among them, so that the location of this token determines which process is scheduled to make the next move. This token structure there...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Web Intelligence and Agent Systems: An International Journal
سال: 2012
ISSN: 1570-1263
DOI: 10.3233/wia-2012-0248